1706B - Making Towers - CodeForces Solution

/* Two Roads Diverged in a Wood, and I Took the One  Less Travelled by,and That Has Made all the Difference */
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define TB                       \
  ios_base ::sync_with_stdio(0); \
  cin.tie(0);                    \
  cout.tie(0);
#define endl '\n'
#define ll long long
#define pb push_back
int main()
{
  TB;
  int tc;
  cin >> tc;
  while (tc--)
  {
    int n,i;
    cin >> n;
    list<int> lst[n + 1];
    for (i = 1; i <= n; i++)
    {
      int x;
      cin >> x;
      lst[x].pb(i);
    }
    for (i = 1; i <= n; i++)
    {
      if (lst[i].size() > 0)
      {
        int cnt = 1;
        int mx = 0;
        int check = lst[i].front();
        lst[i].pop_front();
        while (!lst[i].empty())
        {
          int cc = lst[i].front() - check-1;
          if (cc%2==0)
            cnt++;
          /*else if(cc>3)
          {
            mx = max(mx, cnt);
            cnt = 1;
          }*/
          check = lst[i].front();
          lst[i].pop_front();
        }
        mx = max(mx, cnt);
        cout << mx << " ";
      }
      else
        cout << 0 << " ";
    }
    cout << endl;
  }
}